Minimally Infeasible Set-Partitioning Problems with Balanced Constraints
نویسندگان
چکیده
منابع مشابه
Minimally Infeasible Set-Partitioning Problems with Balanced Constraints
We study properties of systems of linear constraints that are minimally infeasible with respect to some subset S of constraints (i.e. systems that are infeasible, but become feasible upon removal of any constraint in S). We then apply these results and a theorem of Conforti, Cornuéjols, Kapoor, and Vušković, to a class of 0, 1 matrices, for which the linear relaxation of the set partitioning po...
متن کاملAn Infeasible Active Set Method with Combinatorial Line Search for Convex Quadratic Problems with Bound Constraints∗
The minimization of a convex quadratic function under bound constraints is a fundamental building block for solving more complicated optimization problems. The active-set method introduced by Bergounioux et al. [1, 2] has turned out to be a powerful, fast and competitive approach for this problem. Hintermüller et al. [15] provide a theoretical explanation of its efficiency by interpreting it as...
متن کاملSolving Set Partitioning Problems with Constraint Programming
This paper investigates the potential of constraint programming for solving set partitioning problems occurring in crew scheduling, where constraint programming is restricted to not employ external solvers, as for instance integer linear programming solvers. We evaluate preprocessing steps known from the OR literature on moderately sized set partitioning problems. Further, we propose a new prep...
متن کاملImproved Approximation Algorithms for Balanced Partitioning Problems
We present approximation algorithms for balanced partitioning problems. These problems are notoriously hard and we present new bicriteria approximation algorithms, that approximate the optimal cost and relax the balance constraint. In the first scenario, we consider Min-Max k-Partitioning, the problem of dividing a graph into k equal-sized parts while minimizing the maximum cost of edges cut by...
متن کاملEfficent solutions for weight-balanced partitioning problems
We prove polynomial-time solvability of a large class of clustering problems where a weighted set of items has to be partitioned into clusters with respect to some balancing constraints. The data points are weighted with respect to different categories and the clusters adhere to given lower and upper bounds on the total weight of their points with respect to each of these categories. Further th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2007
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.1070.0250